Some Problems on Random Intervals and Annihilating Particles
نویسندگان
چکیده
منابع مشابه
Some Problems on Random Intervals and Annihilating
BY P . ERDŐS AND P . NEY Hungarian Academy of Sciences and University of Wisconsin Particles perform independent random walks on the integers, and are annihilated if they cross paths or land at the same point. The problem is to determine whether the origin is hit infinitely often . The answer is shown to depend on the initial distribution of particles in accordance with a "log log law ." Severa...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
On some annihilating and coalescing systems
In the present paper we continue the investigation of the so-called Coalescing Ideal Gas in one dimension, initiated by the rst author in 7]. The model consists of point-like particles moving with velocities 1 which coalesce and chose a fresh velocity with the same distribution, when colliding. In the previous paper 7] various identities in law were derived for the innnitely extended system. In...
متن کاملSome Problems on Random Walk in Space
Consider the lattice formed by all points whose coordinates are integers in d-dimensional Euclidean space, and let a point S j(n) perform a move randomly on this lattice according to the following rules : At time zero it is at the origin and if at any time n-1 (n = 1, 2. .. .) it is at some point S then at time t it will be at one of the 2d lattice points nearest S, the probability of it being ...
متن کاملSatisfiability Problems on Intervals and Unit Intervals
For an interval graph with some additional order constraints between pairs of non-intersecting intervals, we give a linear time algorithm to determine if there exists a realization which respects the order constraints. Previous algorithms for this problem (known also as seriation with side constraints) required quadratic time. This problem contains as subproblems interval graph and interval ord...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1974
ISSN: 0091-1798
DOI: 10.1214/aop/1176996551